Transposition Game
نویسندگان
چکیده
We introduce a two-player game, in which each player extends a given sequence by picking a free element in a domain D ⊂ R. The aim of the players is to control the parity of the number of transpositions necessary to put the final sequence in order. We will see that the winner can be the last player, the second last player, the first player, the second player, the person who wants the parity to end up even or the person who wants the parity to end up odd. A special case of the game can be reduced to a game with nontrivial winning strategy, but describable in so simple a way that children can understand it and enjoy playing it.
منابع مشابه
Intelligent System for Playing Tarok
We present an advanced intelligent system for playing three-player tarok card game. The system is based on alpha-beta search with several enhancements such as fuzzy transposition table, which clusters strategically similar positions into generalised game states. Unknown distribution of other players' cards is addressed by Monte Carlo sampling. Experimental results show an additional reduction i...
متن کاملA Program for Playing Tarok
A program for playing the three-player tarok card game is presented and the complexity of the game is analyzed. To deal with the unknown distributions of other players’ cards, the program uses a sampling method that accomplishes hierarchical clustering to select representative sets of cards from a host of randomly generated sets. A game tree is searched with the alpha-beta algorithm using sever...
متن کاملSymmetry Detection in General Game Playing
We develop a method for detecting symmetries in arbitrary games and exploiting these symmetries when using tree search to play the game. Games in the General Game Playing domain are given as a set of logic based rules defining legal moves, their effects and goals of the players. The presented method transforms the rules of a game into a vertex-labeled graph such that automorphisms of the graph ...
متن کاملAnalysis of Transposition Tables and Replacement Schemes
A set of experiments were designed to measure the enhancement to alphabeta search using refutation and transposition tables. Results indicate that the use of transposition tables can reduce the size of the game tree by as much as 95%, significantly improving the algorithmic performance of αβ search. Seven replacement schemes to handle collisions in transposition tables were proposed and their p...
متن کاملSolving Kalah
Using full-game databases and optimized tree-search algorithms, the game of Kalah is solved for several starting configurations up to 6 holes and 5 counters per hole. The main search algorithm used was iterative-deepening MTD(f). Major search enhancements were move ordering, transposition tables, futility pruning, enhanced transposition cut-off, and endgame databases.
متن کامل